Suppliers Bidding Strategy in Single Auction Power Pools using Varying Population based Bacterial Foraging Algorithm
نویسنده
چکیده
This paper proposes a novel optimization algorithm Varying Population based Bacterial Foraging Algorithm (VPBFA), to solve optimal bidding strategy in a pool based electricity market. In a power market, Generating Companies (suppliers) participate in the bidding process in order to maximize their profits. Each supplier bid strategically for choosing the bidding coefficients to counter the competitors bidding strategy. Most of the Evolutionary Algorithms (EAs) are based on fixed population evolution, which does not attain the full potential of effective search and demands a large amount of computation. In this paper, a varying population algorithm is developed from the study of bacterial foraging behavior. This algorithm, for the first time, explores the underlying mechanisms of bacterial chemotaxis, quorum sensing and proliferation etc., which have been successfully combined into the varyingpopulation frame. The VPBFA algorithm has been applied to the optimal bidding strategy problem and it has been evaluated by simulation studies, which were undertaken on 75-bus Indian practical system, in comparison with fixed population based algorithms like Bacterial Foraging Algorithm (BFA), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and conventional optimization method called Golden Section Search (GSS) method. The results affirmed the robustness and competence of proposed methodology over BFA, PSO and GA. KeywordsElectricity market, Bidding strategies, Market Clearing Price (MCP), Bacterial Foraging, Varying Population.
منابع مشابه
Probabilistic GENCOs Bidding Strategy in Restructured Two-Side Auction Power Markets
As a matter of course, power market uncertainties escalation is by product of power industry restructure on one hand and the unrivalled penetration of renewable energies on the other. Generally, the decision making process in such an uncertain environment faces with different risks. In addition, the performance of real power markets is very close to oligopoly markets, in which, some market play...
متن کاملOptimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm
In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...
متن کاملBidding Strategy on Demand Side Using Eligibility Traces Algorithm
Restructuring in the power industry is followed by splitting different parts and creating a competition between purchasing and selling sections. As a consequence, through an active participation in the energy market, the service provider companies and large consumers create a context for overcoming the problems resulted from lack of demand side participation in the market. The most prominent ch...
متن کاملSub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm
In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...
متن کاملAn options-based solution to the sequential auction problem
The sequential auction problem is commonplace in open, electronic marketplaces such as eBay. This problem occurs when a buyer faces a complex strategic problem in bidding across multiple auctions, each selling similar or essentially identical items and when the buyer would have a simple, truth-revealing strategy if there was but a single auction event. Our model allows for multiple, distinct go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012